TRB exam online practice test for Computer Science and Engineering dept provides you with ample practice material for TRB exam preparation for cse department which adheres to the real exam format. Each TRB - CSE exam practice test has 10 questions. After completing click on to the COMPLETE TEST to know the score and the correct answers.


Computer Science and Engineering - TRB Online Practice Test - 5

  • Online Practice Test - CSE
   

1.
  ------------------is defined as the degree of interference that a transaction can tolerate in a concurrent environment..
  • A.   Key
  •  
  • B.   Locking
  •  
  • C.   Transaction
  •  
  • D.   Isolation level
  Options: A    B    C    D   
   
 
   

2.
  An attribute of one table matching the primary key of another table is :.
  • A.   Primary key
  •  
  • B.   Unique key
  •  
  • C.   Composite key
  •  
  • D.   Foreign key
  Options: A    B    C    D   
   
   

3.
  The process of obtaining a serializability order of the transactions by finding a linear order consistent with the partial order of the precedence Graph is called --------------.
  • A.   Topological sorting
  •  
  • B.   Serializing
  •  
  • C.   Sequencing
  •  
  • D.   Transaction ordering
  Options: A    B    C    D   
   
 
   

4.
  In a circular queue, the state of queue is full when it is satisfies condition:.
  • A.   Front = (rear mod length)
  •  
  • B.   Front = (length mod rear)
  •  
  • C.   Font = (length mod rear) + 1
  •  
  • D.   Front = (rear mod length) + 1
  Options: A    B    C    D   
   
   

5.
  For balanced search trees, the average time efficiency for searching, insertion and deletion is:.
  • A.   Θ(1)
  •  
  • B.   Θ(n)
  •  
  • C.   Θ(log n)
  •  
  • D.   Θ(n log n)
  Options: A    B    C    D   
   
 
   

6.
  Cross edge is a :.
  • A.   Edge in a DFS tree
  •  
  • B.   Non-tree edge from a vertex u to a proper ancestor of u in a DFS tree
  •  
  • C.   Non-tree edge from a vertex u to a proper descendant of u in a DFS tree
  •  
  • D.   Non-tree edge that connects vertices in two different DFS tree
  Options: A    B    C    D   
   
   

7.
  Which method of traversal does not use stack to hold nodes that are waiting to be processed?.
  • A.   Depth first
  •  
  • B.   D-search
  •  
  • C.   Breadth first
  •  
  • D.   Back tracking
  Options: A    B    C    D   
   
 
   

8.
  Arithmetic expression with unbalanced parenthesis represents--------error..
  • A.   Lexical
  •  
  • B.   Syntactic
  •  
  • C.   Semantic
  •  
  • D.   Logical
  Options: A    B    C    D   
   
   

9.
  Which of the following is not a multiple is issue processor?.
  • A.   Statically scheduled superscalar processor
  •  
  • B.   VLIW processors
  •  
  • C.   Dynamically scheduled superscalar processor
  •  
  • D.   Systolic Array Processor
  Options: A    B    C    D   
   
 
   

10.
  The dirty bit is :.
  • A.   set to 1 when a read operation occurs
  •  
  • B.   set to 1 when a write operation occurs
  •  
  • C.   set to 0 when a read operation occurs
  •  
  • D.   set to 0 when a write operation occurs
  Options: A    B    C    D   
   

Complete Test
tnscholars.com

 

 

 

tnscholars.com.